Automated Telescope Scheduling

نویسنده

  • Mark D. Johnston
چکیده

With the ever increasing level of automation of astronomical telescopes the benefits and feasibility of automated planning and scheduling are becoming more apparent. Improved efficiency and increased overall telescope utilization are the most obvious goals. Automated scheduling at some level has been done for several satellite observatories, but the requirements on these systems were much less stringent than on modern ground or satellite observatories. The scheduling problem is particularly acute for Hubble Space Telescope: virtually all observations must be planned in excruciating detail weeks to months in advance. Space Telescope Science Institute has recently made significant progress on the scheduling problem by exploiting state-of-the-art “artificial intelligence” software technology. What is especially interesting is that this effort has already yielded software that is well-suited to scheduling groundbased telescopes, including the problem of optimizing the coordinated scheduling of more than one telescope.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planning and Scheduling for the Hubble Space Tele- Scope

The Space Telescope Science Institute (STScI) conducts the scien-tiic operations of NASA's Hubble Space Telescope (HST). This paper describes several innovative systems which have been developed to support science operations, including proposal selection, planning and scheduling. The application of these techniques to other observatories and spacecraft is discussed as well.

متن کامل

Automated Management and Scheduling of Remote Automatic Telescopes

This paper describes our project on advanced planning and scheduling for remote, fully automatic telescopes. In addition to a more advanced automatic scheduler for nightly observations, our project is also building automated tools to address the entire life-cycle of an observation request, from original receipt to the return of raw data and preliminary data reduction. Our focus is on providing ...

متن کامل

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

Scheduling and Executing Phase II Observing Scripts on the Hobby★Eberly Telescope

We describe our scheme for scheduling and observing with the Hobby★Eberly Telescope (HET). The HET will be operated 85% of the time in a queue-scheduled, service observing mode. Principal Investigators (PIs) use software planning tools to determine how to make their observations with the HET, and submit proposals for telescope time to local Time Allocation Committees (TACs). Once time has been ...

متن کامل

Interactive, Incremental Scheduling for Virtual Telescopes in Education

The Telescopes in Education (TIE) project, which began in 1992, provides remote access for students to control large observatory telescopes in real time. TIE began with a single telescope, and with manual evaluation and scheduling of student requests. With the sucess of TIE, 20 or more additional telescopes are expected to come on line. With proportionally more student requests, we anticipate t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988